#include<iostream>
#include<vector>
using namespace std;
int ask(int a,int b){
cout<<"? "<<a<<" "<<b<<endl;
cout<<flush;
cin>>a;
return a;
}
void give(int a,int b){
cout<<"! "<<a<<" "<<b<<endl;
cout<<flush;
}
int main(){
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
int t1=ask(1,1);
if(t1>=n){
int t2=ask(1,t1+1);
give(t2+1,t1+1);
}
else if(t1>=m){
int t2=ask(t1+1,1);
give(t1+1,t2+1);
}
else{
int t2=ask(t1+1,1);
int t3=ask(1,t1+1);
if(t2==t1 && t3==t1) give(t1+1,t1+1);
else if(t3==t1) give(t1+1,t2+1);
else give(t3+1,t1+1);
}
}
return 0;
}
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |